A Class of Nonbinary Codes and Their Weight Distribution
نویسندگان
چکیده
Nonlinear functions have important applications in coding theory and cryptography [16, 7]. Linear codes constructed from functions with high nonlinearity [17, 11, 2, 6] can be good and have useful applications in communications [9, 19, 10, 18] or cryptography [5, 4, 3, 21]. For a code, its weight distribution is important to study its structure and to provide information on the probability of undetected error when the code is used for error detection. Throughout this paper, let Fq be the finite field with q = p n elements for a prime p and a positive integer n, and let Fq be the multiplicative group of Fq. For an even integer n ≥ 4, let C k denote the [pn − 1, 5n/2] cyclic code given by Ck = {
منابع مشابه
Estimates of the distance distribution of nonbinary codes, with applications
We use the polynomial method to derive upper and lower bounds on the distance distribution of nonbinary codes in the Hamming space. Applications of the bounds include a better asymptotic upper bound on the weight distribution of Goppa codes from maximal curves, a new upper bound on the size of a q-ary code with a given rth generalized weight, improved estimates of the size of secant spaces of a...
متن کاملA New Construction of Nonbinary Polar Codes with Two-stage Polarization
In this paper, we propose a new class of nonbinary polar codes with two-stage polarization, where the outer polarization (symbol-level polarization) kernel is a nonbinary matrix resembling Arıkan’s kernel, and the inner polarization (bit-level polarization) kernel is a properly designed binary matrix. The encoder/decoder of the proposed nonbinary polar codes have the same structure as the origi...
متن کاملHigh-throughput architecture and implementation of regular (2, dc) nonbinary LDPC decoders
Nonbinary LDPC codes have shown superior performance, but decoding nonbinary codes is complex, incurring a long latency and a much degraded throughput. We propose a low-latency variable processing node by a skimming algorithm, together with a low-latency extended min-sum check processing node by prefetching and relaxing redundancy control. The processing nodes are jointly designed for an optima...
متن کاملNonbinary Quasi-Cyclic LDPC Cycle Codes with Low-Density Systematic Quasi-Cyclic Generator Matrices
In this letter, we propose an appealing class of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) cycle codes. The parity-check matrix is carefully designed such that the corresponding generator matrix has some nice properties: 1) systematic, 2) quasi-cyclic, and 3) sparse, which allows a parallel encoding with low complexity. Simulation results show that the performance of the propose...
متن کاملConstruction of [[n,n − 4,3]]q quantum codes for odd prime power q
The theory of quantum error-correcting codes (QECCs, for short) has been exhaustively studied in the literature; see [1–8]. The most widely studied class of quantum codes are binary quantum stabilizer codes. A thorough discussion on the principles of quantum coding theory was given in [3] and [4] for binary quantum stabilizer codes. An appealing aspect of binary quantum codes is that there exis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0802.3430 شماره
صفحات -
تاریخ انتشار 2008